On determinism versus unambiquous nondeterminism for decision trees
نویسنده
چکیده
منابع مشابه
Proposed running title : Decision Trees with
We investigate decision trees in which one is allowed to query threshold functions of subsets of variables. We are mainly interested in the case were only queries of AND and OR are allowed. This model is a generalization of the classical decision tree model. Its complexity (depth) is related to the parallel time that is required to compute Boolean functions in certain CRCW PRAM machines with on...
متن کاملDecision Trees with Boolean Threshold Queries
We investigate decision trees in which one is allowed to query threshold functions of subsets of variables. We are mainly interested in the case were only queries of AND and OR are allowed. This model is a generalization of the classical decision tree model, and its complexity (depth) is related to the parallel time that is required to compute Boolean functions in certain CRCW PRAM machines wit...
متن کاملOn Regular Sets of Bounds and Determinism versus Nondeterminism
This paper illustrates the richness of the concept of regular sets of time bounds and demonstrates its application to problems of computational complexity. There is a universe of bounds whose regular subsets allow to represent several time complexity classes of common interest and are linearly ordered with respect to the confinality relation which implies the inclusion between the corresponding...
متن کاملComputation Power of Randomization and Nondeterminism
The fundamental questions of computation theory are related to the relative power of determinism, nondeterminism, and randomization. The famous P vs. NP problem is not the only one of main interest. The class of practically solvable algorithmic problems is not specified by deterministic polynomial time (P) anymore, but by bounded-error polynomial time algorithms. Hence, the comparison of the ef...
متن کاملCorrectness and Refinement of Dually Nondeterministic Programs
In this paper we extend different reasoning methods from traditional (demonic) programs to programs with both demonic and angelic nondeterminism. In particular, we discuss correctness proofs, and refinement of programs while reducing angelic nondeterminism (into demonic nondeterminism or determinism). As expected, reducing angelic nondeterminism is generally not a refinement; however, when cont...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره شماره
صفحات -
تاریخ انتشار 2002